Invited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010.

This volume constitutes the refereed proceedings of the 24th International Workshop on Computer Science Logic, CSL 2010, held in Brno, Czech Republic, in August 2010. The 33 full papers presented together with 7 invited talks, were carefully reviewed and selected from 103 submissions. Topics covered include automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, modal and temporal logic, model checking, decision procedures, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, and nonmonotonic reasoning.